Embedding a Forest in a Graph
نویسندگان
چکیده
منابع مشابه
Embedding a Forest in a Graph
For p ≥ 1, we prove that every forest with p trees whose sizes are a1, . . . , ap can be embedded in any graph containing at least ∑p i=1(ai + 1) vertices and having a minimum degree at least ∑p i=1 ai.
متن کاملGraph Embedding
Some of the parameters used to analyze the efficiency of an embedding are dilation, expansion, edge congestion and wirelength. If e = (u, v) ∈E (G), then the length of Pf (e) in H is called the dilation of the edge e. The maximal dilation over all edges of G is called the dilation of the embedding f. The dilation of embedding G into H is the minimum dilation taken over all embeddings f of G int...
متن کاملMob { A Parallel Heuristic for Graph - Embedding
We have extended the Mob heuristic for graph partitioning [21] to grid and hypercube embedding and have e ciently implemented our new heuristic on the CM-2 Connection Machine. We have conducted an extensive series of experiments to show that it exploits parallelism, is fast, and gives very low embedding costs. For example, on the 32K-processor CM-2 it runs in less than 30 minutes on random grap...
متن کاملGraph Embedding and Dimensionality Reduction - A Survey
Dimension reduction is defined as the process of mapping high-dimensional data to a lowerdimensional vector space. Most machine learning and data mining techniques may not be effective for high-dimensional data. In order to handle this data adequately, its dimensionality needs to be reduced. Dimensionality reduction is also needed for visualization, graph embedding, image retrieval and a variet...
متن کاملEmbedding of a 2D Graphene System in Non-Commutative Space
The BFT approach is used to formulate the electronic states in graphene through a non-commutative space in the presence of a constant magnetic field B for the first time. In this regard, we introduce a second class of constrained system, which is not gauge symmetric but by applying BFT method and extending phase space, the second class constraints converts to the first class constraints so th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/586